package com.berchen.数据结构.递归;

public class MazeTest {
    public static void main(String[] args) {
        int[][] map=new int[8][7];
        for(int i =0;i<7;i++){
            map[0][i]=1;
            map[7][i]=1;
        }
        for(int i =1;i<7;i++){
            map[i][0]=1;
            map[i][6]=1;
        }
        map[3][1]=1;
        map[3][2]=1;

        for (int i =0;i<8;i++){
            for(int j =0;j<7;j++){
                System.out.printf("%d\t",map[i][j]);
            }
            System.out.println();
        }
        System.out.println("路径找到了");

        Maze maze = new Maze();
        maze.getWay(map,1,1,6,5);

        for (int i =0;i<8;i++){
            for(int j =0;j<7;j++){
                System.out.printf("%d\t",map[i][j]);
            }
            System.out.println();
        }
    }
}
